Filtering for networked stochastic time-delay systems with sector nonlinearity

Copyright [2009] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This paper is concerned with the filtering problem for a class of discrete-time stochastic nonlinear networked control systems with network-induced incomplete measurements. The incomplete measurements include both the multiple random communication delays and random packet losses, which are modeled by a unified stochastic expression in terms of a set of indicator functions that is dependent on certain stochastic variable. The nonlinear functions are assumed to satisfy the sector nonlinearities. The purpose of the addressed filtering problem is to design a linear filter such that the filtering-error dynamics is exponentially mean-square stable. By using the linear-matrix-inequality (LMI) method and delay-dependent technique, sufficient conditions are derived which are dependent on the occurrence probability of both the random communication delays and missing measurement. The filter gain is then characterized by the solution to a set of LMIs. A simulation example is exploited to demonstrate the effectiveness of the proposed design procedures

Repeating head-on collisions in an optical trap and the evaluation of spin-dependent interactions among neutral particles

A dynamic process of repeating collisions of a pair of trapped neutral particles with weak spin-dependent interaction is designed and studied. Related theoretical derivation and numerical calculation have been performed to study the inherent coordinate-spin and momentum-spin correlation. Due to the repeating collisions the effect of the weak interaction can be accumulated and enlarged, and therefore can be eventually detected. Numerical results suggest that the Cr-Cr interaction, which has not yet been completely clear, could be thereby determined. The design can be in general used to determine various interactions among neutral atoms and molecules, in particular for the determination of very weak forces.Comment: 15 pages, 7 figure

Two-body scattering in a trap and a special periodic phenomenon sensitive to the interaction

Two-body scattering of neutral particles in a trap is studied theoretically. The control of the initial state is realized by using optical traps. The collisions inside the trap occur repeatedly; thereby the effect of interaction can be accumulated. Two periodic phenomena with a shorter and a much longer period, respectively, are found. The latter is sensitive to the interaction. Instead of measuring the differential cross section as usually does, the measurement of the longer period and the details of the periodic behavior might be a valid source of information on weak interactions among neutral particles.Comment: 5 pages, 5 figure

On defining partition entropy by inequalities

Partition entropy is the numerical metric of uncertainty within a partition of a finite set, while conditional entropy measures the degree of difficulty in predicting a decision partition when a condition partition is provided. Since two direct methods exist for defining conditional entropy based on its partition entropy, the inequality postulates of monotonicity, which conditional entropy satisfies, are actually additional constraints on its entropy. Thus, in this paper partition entropy is defined as a function of probability distribution, satisfying all the inequalities of not only partition entropy itself but also its conditional counterpart. These inequality postulates formalize the intuitive understandings of uncertainty contained in partitions of finite sets.We study the relationships between these inequalities, and reduce the redundancies among them. According to two different definitions of conditional entropy from its partition entropy, the convenient and unified checking conditions for any partition entropy are presented, respectively. These properties generalize and illuminate the common nature of all partition entropies